A Term Equality Problem Equivalent to Graph Isomorphism
نویسنده
چکیده
We demonstrate that deciding if two terms containing otherwise uninter-preted associative, commutative, and associative-commutative function symbols and commutative variable-binding operators are equal is polynomially equivalent to determining if two graphs are isomorphic. The reductions we use provide insight into this result and suggest polynomial time special cases.
منابع مشابه
Quantum lower bounds of set equality problems
The set equality problem is to decide whether two sets given by functions a and b such that A = {a(1), a(2), ..., a(n)} and B = {b(1), b(2), ..., b(n)} are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set equality problem. This motivates to find a polynomial quantum lower bound for th...
متن کاملQuantum lower bounds for the set equality problems
The set equality problem is to decide whether two sets A and B are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set equality problem. It was an open problem to find any w(1) query lower bound when sets A and B are given by quantum oracles with functions a and b. We will prove Ω( n 1/3...
متن کاملReduction of the Graph Isomorphism Problem to Equality Checking of n-variables Polynomials and the Algorithms that Use the Reduction
The graph isomorphism problem is considered. We assign modified characteristic polynomials for graphs and reduce the graph isomorphism problem to the following one. It is required to find out, is there such an enumeration of the graphs vertices that the polynomials of the graphs are equal. We present algorithms that use the redution and we show that we may check equality of the graphs polynomia...
متن کاملA Polynomial Quantum Query Lower Bound for the Set Equality Problem
The set equality problem is to tell whether two sets A and B are equal or disjoint under the promise that one of these is the case. This problem is related to the Graph Isomorphism problem. It was an open problem to find any w(1) query lower bound when sets A and B are given by quantum oracles. We will show that any error-bounded quantum query algorithm that solves the set equality problem must...
متن کاملThe Complexity of Boolean Constraint Isomorphism
We consider the Boolean constraint isomorphism problem, that is, the problem of determining whether two sets of Boolean constraint applications can be made equivalent by renaming the variables. We show that depending on the set of allowed constraints, the problem is either coNP-hard and GI-hard, equivalent to graph isomorphism, or polynomial-time solvable. This establishes a complete classifica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 51 شماره
صفحات -
تاریخ انتشار 1994